The multiple team formation problem using sociometry
نویسندگان
چکیده
منابع مشابه
Submodularity in Team Formation Problem
We consider the team formation problem where the goal is to find a team of experts for a specific project. In the past, several attempts have been made to formulate this problem and each formulation focuses only on a subset of design criteria such as skill coverage, social compatibility, economy, skill redundancy, etc. In this paper, for the first time, we show that most of the important design...
متن کاملMultiple Task Allocation Problems with Team Formation
Multiple task allocation with team formation is a NP-hard hierarchical combinatorial optimization problem, and some restrictions must be imposed on task and team combinations. Through task classification, and imposing restrictions on the number of tasks that an agent can perform, and the number of agents that a team can have, the set of feasible allocations is significantly reduced. Based on th...
متن کاملAn improved particle swarm optimization with a new swap operator for team formation problem
Formation of effective teams of experts has played a crucial role in successful projects especially in social networks. In this paper, a new particle swarm optimization (PSO) algorithm is proposed for solving a team formation optimization problem by minimizing the communication cost among experts. The proposed algorithm is called by improved particle optimization with new swap operator (IPSONSO...
متن کاملThe shift team formation problem in multi-shift manufacturing operations
This paper addresses the problem of assigning operators to teams that work in single-, two-, or three-day shift systems. The problem was motivated by, and illustrated with a case situation encountered in Dutch manufacturing industry. The problem addressed forms an extension of cell formation problems which are currently in the phase of addressing labor-related issues in cell design. A generaliz...
متن کاملThe Multiconstraint Team Orienteering Problem with Multiple Time Windows
The Orienteering Problem (OP) is a combinatorial routing problem of which the goal is to find a tour that maximises the total score earned by visiting vertices. A set of vertices is given, determined by their coordinates and a score. The pairwise travel times between the vertices are known. The total travel time should not exceed a predetermined time budget. Each vertex can be visited at most o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2016
ISSN: 0305-0548
DOI: 10.1016/j.cor.2016.05.012